A Heuristic for Ordering a Linear Block Code to Minimize Trellis State Complexity
نویسندگان
چکیده
| An important problem in the theory and application of block code trellises is to nd a coordinate permutation for a given code that minimizes the trellis state complexity. In this paper we show that the problem of minimizing a given component of the state complexity proole is NP-complete. We describe an algorithm, though not guaranteed to nd an optimal coordinate ordering, uses a heuristic descent technique to nd \good" solutions to the problem. We have applied this algorithm to various codes, and our results are tabulated.
منابع مشابه
Trellis Complexity Bounds for Decoding Linear Block Codes
We consider the problem of finding a trellis for a finear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on comple...
متن کاملOn the intractability of permuting a block code to minimize trellis complexity
| An important problem in the theory and application of block code trellises is to nd a coordinate permutation of a given code to minimize the trellis complexity. In this paper we show that the problem of nding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trellis for a binary linear block code is NP-complete.
متن کاملDimension/length profiles and trellis complexity of linear block codes
This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its " generalized Hamming weight hierarchy " 111, and the complexity of its minimal trellis diagram. These connections are close andtdeep. DLP duality is closely related to trellis duality. The DLP of a code gives tight bounds on its state and branch c...
متن کاملOn the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on
A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...
متن کاملTrellis decoding complexity of linear block codes
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...
متن کامل